TMIA: A Tree-Based Multi-Reader Interactive Anti-Collision Algorithm for RFID Tag Identification
نویسندگان
چکیده
منابع مشابه
Anti-collision Algorithms for Multi-Tag RFID
RFID is one of automatic technology to identify and collect object data quickly through RF digital signals. RFID increases productivity and convenience. RFID is used for hundreds, if not thousands, of applications such as preventing theft of automobiles and merchandise; gaining entrance to buildings; automating parking. But one of the largest disadvantages in RFID system is its low tag (transpo...
متن کاملa sift distribution multi-channel reader anti-collision for rfid systems
rfid system is a wireless technology that can transfer data between tags and readers via radio frequency. in an rfid network, readers are located close to each other to obtain optimal connectivity and sufficient coverage. in such an environment, which is called dense reader environment (dre).different types of collisions such as reader-to-reader and reader-to-tag ones, often lead to serious pro...
متن کاملUnified Q-ary Tree for RFID Tag Anti-Collision Resolution
Radio Frequency Identification (RFID) technology uses radio-frequency waves to automatically identify people or objects. A large volume of data, resulting from the fast capturing RFID readers and a huge number of tags, poses challenges for data management. This is particularly the case when a reader simultaneously reads multiple tags and Radio Frequency (RF) collisions occur, causing RF signals...
متن کاملA Novel RFID Anti-Collision Algorithm based on Binary Tree
The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorit...
متن کاملResearch of Matrix-based Grouping Method on Anti-collision Algorithm for RFID Tag Identification
Abstract Currently, the Binary Search Tree (BST) algorithm is mainly used for continuous identification signal processing on active RFID tags. However, tag population is unlimited increasing. With using the BST, the number of identified tags is limited at an average period of time. In this paper, we propose the BST algorithm of the matrix-based grouping to accelerate the recognition speed of ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2991027